SUPER-STRONG REPRESENTATION THEOREMS FOR NONDETERMINISTIC SEQUENTIAL DECISION PROCESSES

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generic Program for Sequential Decision Processes

1 Motivation A generic program for a class of problems is a program which can be used to solve each problem in that class by suitably instantiating its parameters. The most celebrated example of a generic program is the algorithm of Aho, Hopcroft and Ullman for the algebraic path problem 1]. Here we have a single program, pa-rameterised by a number of operators, that solves numerous seemingly d...

متن کامل

Nondeterministic controllers of nondeterministic processes

The controller synthesis problem as formalized by Ramadge and Wonham consists of finding a finite controller that when synchronized with a given plant results in a system satisfying a required property. In this setting, both a plant and a controller are deterministic finite automata, while synchronization is modelled by a synchronous product. Originally, the framework was developed only for saf...

متن کامل

Hidden-Mode Markov Decision Processes for Nonstationary Sequential Decision Making

Nonstationary Sequential Decision Making Samuel P. M. Choi, Dit-Yan Yeung, and Nevin L. Zhang Department of Computer Science, Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong fpmchoi,dyyeung,[email protected]

متن کامل

WEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS

The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...

متن کامل

Mixed Strong Form Representation Particle Method for Solids and Structures

In this paper, a generalized particle system (GPS) method, a general method to describe multiple strong form representation based particle methods is described. Gradient, divergence, and Laplacian operators used in various strong form based particle method such as moving particle semi-implicit (MPS) method, smooth particle hydrodynamics (SPH), and peridynamics, can be described by the GPS metho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Operations Research Society of Japan

سال: 2017

ISSN: 0453-4514,2188-8299

DOI: 10.15807/jorsj.60.136